考虑运输时间柔性作业车间调度问题的快速寻优方法

为了快速获得考虑运输时间的柔性生产调度问题的近优解,进行了快速寻优方法研究。采用运输时间矩阵对析取图模型进行改进,建立了设备选择的多阶段决策方法。建立了考虑运输时间的关键链优化方法,通过邻域搜索快速获得近优解。开发了调度实验系统对上述工作进行验证。实验结果表明,该方法可较稳定地获得近优调度解,并具有较好的计算效率。     

面向新能源并网的电力系统鲁棒调度模式

为了应对大规模新能源并网下电力系统的多种随机因素,提出了一种基于"鲁棒调度计划"+"鲁棒运行区域"的多时间尺度滚动调度模式。首先,在分析传统多时间尺度调度模式存在问题的基础上,提出了一种改进的多时间尺度鲁棒调度模式。然后,阐述了鲁棒调度的基本实施过程,通过算例对实施过程进行模拟,并与传统调度模式进行对比说明了所提模式的优越性。最后,对实现多时间尺度鲁棒调度模式的关键技术进行探讨,为面向新能源并网的电力系统调度提供参考思路。     

车间底漆在船厂生产线应用对比

在船厂生产线上将水性无机锌底漆和无机硅酸锌车间底漆进行对比试验研究,重点探讨了水性无机锌车间底漆在生产线的适用性,实验显示,水性无机锌车间底漆可以在预处理流水线上使用,其干燥时间、附着力、焊接与切割、耐候性等方面能达到船厂生产线的要求。     

水利水电工程网络进度计划标准化系统研发

水利水电工程网络进度计划是施工组织设计的重要组成部分。针对目前大多数网络进度计划软件在进度计划生成、分析等方面提供的功能有限,使得网络进度计划编制费时、费力,效率不高,且标准化程度不高等问题,本文在分析了水利水电工程网络进度计划标准化内涵的基础上,对网络进度计划标准化的基本内容进行了研究;在此基础上设计开发了水利水电工程网络进度计划标准化系统,详细介绍了网络进度计划辅助生成、分析、评价与审阅,以及成果输出等功能。该系统不仅界面友好、直观可视化,而且提供了强大的计算及优化功能,大大提高了工程人员网络进度计划编制的效率和质量,为网络进度计划快速分析和优化提供了一种新的思路和手段。     

BIM技术在4D施工进度模拟的应用探讨

随着建筑施工动态管理日趋复杂,传统的进度管理方式已无法适应现代化建设的需要,基于BIM的施工进度模拟应运而生。4D施工进度模拟以BIM技术为工具,以某公共建筑为工程背景,利用Navisworks软件关联由Revit建立的建筑、结构以及机电设备的BIM模型和施工进度计划Project文件,动态演示整体和局部的施工过程以及施工场地布置情况。一方面可以直观地展示整个施工过程,实现施工过程的可视化管理。另一方面,有效实现了4D进度模拟与Project文件中的数据对接,为工程管理者管理大型建设项目提供了新途径和方法。     

A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility

The traditional flexible job shop scheduling problem (FJSP) considers machine flexibility but not worker flexibility. Given the influence and potential of human factors in improving production efficiency and decreasing the cost in practical production systems, we propose a mathematical model of an extended FJSP with worker flexibility (FJSPW). A hybrid artificial bee colony algorithm (HABCA) is presented to solve the proposed FJSPW. For the HABCA, effective encoding, decoding, crossover and mutation operators are designed, and a new effective local search method is developed to improve the speed and exploitation ability of the algorithm. The Taguchi method of Design of Experiments is used to obtain the best combination of key parameters of the HABCA. Extensive computational experiments carried out to compare the HABCA with some well-performing algorithms from the literature confirm that the proposed HABCA is more effective than these algorithms, especially on large-scale FJSPW instances.     

Blockchain-oriented dynamic modelling of smart contract design and execution in the supply chain

Recently, the applications of Blockchain technology have begun to revolutionise different aspects of supply chain (SC) management. Among others, Blockchain is a platform to execute the smart contracts in the SC as transactions. We develop and test a new model for smart contract design in the SC with multiple logistics service providers and show that this problem can be presented as a multi-processor flexible flow shop scheduling. A distinctive feature of our approach is that the execution of physical operations is modelled inside the start and completion of cyber information services. We name this modelling concept ‘virtual operation’. The constructed model and the developed experimental environment constitute an event-driven dynamic approach to task and service composition when designing the smart contract. Our approach is also of value when considering the contract execution stage. The use of state control variables in our model allows for operations status updates in the Blockchain that in turn, feeds automated information feedbacks, disruption detection and control of contract execution. The latter launches the re-scheduling procedure, comprehensively combining planning and adaptation decisions within a unified methodological framework of dynamic control theory. The modelling complex developed can be used to design and control smart contracts in the SC.     

An Ant Colony Algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs

This paper concerns with the Job Shop Scheduling Problem (JSSP) considering the transportation times of the jobs from one machine to another. The goal of a basic JSSP is to determine starting and ending times for each job in which the objective function can be optimized. In here, several Automated Guided Vehicles (AGVs) have been employed to transfer the jobs between machines and warehouse located at the production environment. Unlike the advantages of implemented automatic transportation system, if they are not controlled along the routes, it is possible that the production system encounters breakdown. Therefore, the Conflict-Free Routing Problem (CFRP) for AGVs is considered as well as the basic JSSP. Hence, we proposed a mathematical model which is composed of JSSP and CFRP, simultaneously and since the problem under study is NP-hard, a two stage Ant Colony Algorithm (ACA) is also proposed. The objective function is to minimize the total completion time (make-span). Eventually, in order to show the model and algorithm’s efficiency, the computational results of 13 test problems and sensitivity analysis are exhibited. The obtained results show that ACA is an efficient meta-heuristic for this problem, especially for the large-sized problems. In addition, the optimal number of both AGVs and rail-ways in the production environment is determined by economic analysis.     

多工作日历下流水作业调度遗传优化方法

针对多工作日历下的流水作业调度问题，提出了一种遗传优化方法。首先，提出了基于多工作日历的时间推算方法，解决了多工作日历下流水作业调度的关键问题：以Excel为平台设计了“工作制”工作表和“设备”工作表，在“设备”工作表中为每台设备指定工作制并设定工作时段；在此基础上，以Excel VBA为平台设计了5个基于工作日历的时间推算函数。其次，以Excel VBA为平台设计了遗传算法用于求解问题：个体采用整数编码方式，交叉操作采用“交换交叉”方式，变异操作采用“交换变异”方式，解码过程采用基于多工作日历的时间推算方法准确计算各工序开工和完工时刻。最后，通过案例分析验证了所提方法的有效性。